Advances in Web Technologies and Applications

RankSVR can preference data help regression%3F

On supporting effective web extraction.

Enabling multi%2Dlevel relevance feedback on PubMed by integrating rank learning into DBMS.

Efficient feature weighting methods for ranking.

VRIFA a nonlinear SVM visualization tool using nomogram and localized radial basis function %28LRBF%29 kernels.

RefMed relevance feedback retrieval system fo PubMed.

Enabling multi%2Dlevel relevance feedback on pubmed by integrating rank learning into DBMS.

Fault detection in IP%2Dbased process control networks using data mining.

RV%2DSVM An Efficient Method for Learning Ranking SVM.

RV%2DSVM An Efficient Method for Learning Ranking SVM.



Support Vector Machine.
LIBSVM is a library for support vector machines (SVM). Its goal is to help users can easily use SVM as a tool. In this document, we present all its implementation details. 1
Application of irregular and unbalanced data to predict diabetic nephropathy using visualization and feature selection methods.

Application of irregular and unbalanced data to predict diabetic nephropathy using visualization and feature selection methods.

Nonlinear Support Vector Machine Visualization for Risk Factor Analysis Using Nomograms and Localized Radial Basis Function Kernels.

Supporting personalized ranking over categorical attributes.

Privacy%2Dpreserving SVM classification.
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects. What is required is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results, while providing guarantees on the non-disclosure of data. Support vector machine classification is one of the most widely used classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification, PP-SVM for short. Our solution constructs the global SVM classification model from the data distributed at multiple parties, without disclosing the data of each party to others. We assume that data is horizontally partitioned – each party
Mining and processing category ranking.

Enabling soft queries for data retrieval.

Privacy%2DPreserving SVM Classification on Vertically Partitioned Data.

Privacy%2Dpreserving SVM using nonlinear kernels on horizontally partitioned data.
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects. What is required is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results, while providing guarantees on the non-disclosure of data. Support vector machine classification is one of the most widely used classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification, PP-SVM for short. Our solution constructs the global SVM classification model from the data distributed at multiple parties, without disclosing the data of each party to others. We assume that data is horizontally partitioned – each party
Privacy%2Dpreserving SVM using nonlinear kernels on horizontally partitioned data.
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects. What is required is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results, while providing guarantees on the non-disclosure of data. Support vector machine classification is one of the most widely used classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification, PP-SVM for short. Our solution constructs the global SVM classification model from the data distributed at multiple parties, without disclosing the data of each party to others. We assume that data is horizontally partitioned – each party
Enabling Ad%2Dhoc Ranking for Data Retrieval.
Data retrieval – finding relevant data from large databases – has become a serious problem. Consider user Amy, who is looking for a house in Chicago. She searches realtor.com with a few constraints on city, price range, beds, baths, which returns 3,581 matching houses. Or, Amy may realize that she must “narrow ” her query – However, on this extreme, and equally undesirable, she may as well get no hits at all. She will likely manually “oscillate” between these extremes, before eventually managing to complete her data retrieval task, if at all. Relational databases offer little support for such retrieval tasks. Traditional Boolean-based query models like SQL are based on “hard ” criteria (e.g., price ¢ $100,000) while users often employ “soft ” criteria for their specific senses of “relevance ” or “preference. ” Unlike flat Boolean results,
SVM selective sampling for ranking with application to data retrieval.

Mining Behavior Graphs for %22Backtrace%22 of Noncrashing Bugs.
Analyzing the executions of a buggy software program is essentially a data mining process. Although many interesting methods have been developed to trace crashing bugs (such as memory violation and core dumps), it is still difficult to analyze noncrashing bugs (such as logical errors). In this paper, we develop a novel method to classify the structured traces of program executions using software behavior graphs. By analyzing the correct and incorrect executions, we have made good progress at the isolation of program regions that may lead to the faulty executions. The classification framework is built on an integration of closed graph mining and SVM classification. More interestingly, suspicious regions are identified through the capture of the classification accuracy change, which is measured incrementally during program execution. Our performance study and case-based experiments show that our approach is both effective and efficient.
Making SVMs Scalable to Large Data Sets using Hierarchical Cluster Indexing.
Support vector machines (SVMs) have been promising methods for classification and regression analysis due to their solid mathematical foundations, which include two desirable properties: margin maximization and non-linear classification using kernels. However, despite these prominent properties, SVMs are usually not chosen for large-scale data mining problems because their training complexity is highly dependent on the data set size. Unlike traditional pattern recognition and machine learning, real-world data mining applications often involve huge num-bers of data records. Thus it is too expensive to perform multiple scans on the entire data set, and it is also infeasible to put the data set in memory. This paper presents a method, Clustering-Based SVM (CB-SVM), that maximizes the SVM performance for very large data sets given a limited amount of resource, e.g., memory. CB-SVM applies a hierarchical micro-clustering algorithm that scans the entire data set only once to provide an SVM with high quality samples. These samples carry statistical summaries of the data and maximize the benefit of learning. Our analyses show that the training complexity of CB-SVM is quadratically dependent on the number of support vectors, which is usually much less than that of the entire data set. Our experiments on synthetic and real-world data sets show that CB-SVM is highly scalable for very large data sets and very accurate in terms of classification. I.
Single%2DClass Classification with Mapping Convergence.
Web page classification is one of the essential techniques for Web mining because classifying Web pages of an interesting  class is often the first step of mining the Web. However, constructing a classifier for an interesting class requires laborious preprocessing  such as collecting positive and negative training examples. For instance, in order to construct a &#034;homepage&#034; classifier, one  needs to collect a sample of homepages (positive examples) and a sample of nonhomepages (negative examples). In particular,  collecting negative training examples requires arduous work and caution to avoid bias. This paper presents a framework, called  Positive Example Based Learning (PEBL), for Web page classification which eliminates the need for manually collecting negative  training examples in preprocessing. The PEBL framework applies an algorithm, called Mapping-Convergence (M-C), to achieve high  classification accuracy (with positive and unlabeled data) as high as that of a traditional SVM (with positive and negative data). M-C  runs in two stages: the mapping stage and convergence stage. In the mapping stage, the algorithm uses a weak classifier that draws  an initial approximation of &#034;strong&#034; negative data. Based on the initial approximation, the convergence stage iteratively runs an internal  classifier (e.g., SVM) which maximizes margins to progressively improve the approximation of negative data. Thus, the class boundary  eventually converges to the true boundary of the positive class in the feature space. We present the M-C algorithm with supporting  theoretical and experimental justifications. Our experiments show that, given the same set of positive examples, the M-C algorithm  outperforms one-class SVMs, and it is almost as accurate as the traditional SVMs.
Scalable Construction of Topic Directory with Nonparametric Closed Termset Mining.

PEBL Web Page Classification without Negative Examples.
Web page classification is one of the essential techniques for Web mining because classifying Web pages of an interesting  class is often the first step of mining the Web. However, constructing a classifier for an interesting class requires laborious preprocessing  such as collecting positive and negative training examples. For instance, in order to construct a &#034;homepage&#034; classifier, one  needs to collect a sample of homepages (positive examples) and a sample of nonhomepages (negative examples). In particular,  collecting negative training examples requires arduous work and caution to avoid bias. This paper presents a framework, called  Positive Example Based Learning (PEBL), for Web page classification which eliminates the need for manually collecting negative  training examples in preprocessing. The PEBL framework applies an algorithm, called Mapping-Convergence (M-C), to achieve high  classification accuracy (with positive and unlabeled data) as high as that of a traditional SVM (with positive and negative data). M-C  runs in two stages: the mapping stage and convergence stage. In the mapping stage, the algorithm uses a weak classifier that draws  an initial approximation of &#034;strong&#034; negative data. Based on the initial approximation, the convergence stage iteratively runs an internal  classifier (e.g., SVM) which maximizes margins to progressively improve the approximation of negative data. Thus, the class boundary  eventually converges to the true boundary of the positive class in the feature space. We present the M-C algorithm with supporting  theoretical and experimental justifications. Our experiments show that, given the same set of positive examples, the M-C algorithm  outperforms one-class SVMs, and it is almost as accurate as the traditional SVMs.
Text classification from positive and unlabeled documents.
Most existing studies of text classification assume that the training data are completely labeled. In reality, however, many information retrieval problems can be more accurately described as learning a binary classifier from a set of incompletely labeled examples, where we typically have a small number of labeled positive examples and a very large number of unlabeled examples. In this paper, we study such a problem of performing Text Classification WithOut labeled Negative data (TC-WON). In this paper, we explore an efficient extension of the standard Support Vector Machine (SVM) approach, called SVMC (Support Vector Mapping Convergence) [17], for the TC-WON tasks. Our analyses show that when the positive training data is not too under-sampled, SVMC significantly outperforms other methods because SVMC basically exploits the natural &#034;gap&#034; between positive and negative documents in the feature space, which eventually corresponds to improving the generalization performance. In the text domain there are likely to exist many gaps in the feature space because a document is usually mapped to a sparse and high dimensional feature space. However, as the number of positive training data decreases, the boundary of SVMC starts overfitting at some point and end up generating very poor results. This is because when the positive training data is too few, the boundary over-iterates and trespasses the natural gaps between positive and negative class in the feature space and thus ends up fitting tightly around the few positive training data.
Discovering Compact and Highly Discriminative Features or Feature Combinations of Drug Activities Using Support Vector Machines.
Nowadays, high throughput experimental techniques make it feasible to examine and collect massive data at the molecular level. These data, typically mapped to a very high dimensional feature space, carry rich information about functionalities of certain chemical or biological entities and can be used to infer valuable knowledge for the purposes of classification and prediction. Typically, a small number of features or feature combinations may play determinant roles in functional discrimination. The identification of such features or feature combinations is of great importance. In this paper, we study the problem of discovering compact and highly discriminative features or feature combinations from a rich feature collection. We employ the support vector machine as the classification means and aim at finding compact feature combinations. Comparing to previous methods on feature selection, which identify features solely based on their individual roles in the classification, our method is able to identify minimal feature combinations that ultimately have determinant roles in a systematic fashion. Experimental study on drug activity data shows that our method can discover descriptors that are not necessarily significant individually but are most significant collectively.

SVMC Single%2DClass Classification With Support Vector Machines.


Heterogeneous Learner for Web Page Classification.
Classification of an interesting class of Web pages (e.g., personal homepages, resume pages) has been an interesting problem. Typical machine learning algorithms for this problem require two classes of data for training: positive and negative training examples. However, in application to Web page classification, gathering an unbiased sample of negative examples appears to be difficult. We propose a heterogeneous learning framework for classifying Web pages, which (1) eliminates the need for negative training data, and (2) increases classification accuracy by using two heterogeneous learners. Our framework uses two heterogeneous learners -- a decision list and a linear separator which complement each other -- to eliminate the need for negative training data in the training phase and to increase the accuracy in the testing phase. Our results show that our heterogeneous framework achieves high accuracy without requiring negative training data; it enhances the accuracy of linear separators by reducing the errors on &#034;low-margin data&#034;. That is, it classifies more accurately while requiring less human efforts in training.
PEBL positive example based learning for Web page classification using SVM.
for Web mining. Specifically, classifying Web pages of a user-interesting class is the first step of mining interesting information from the Web. However, constructing a classifier for an interesting class requires laborious pre-processing such as collecting positive and negative training examples. For instance, in order to construct a &#034;homepage&#034; classifier, one needs to collect a sample of homepages (positive examples) and a sample of non-homepages (negative examples). In particular, collecting negative training examples requires arduous work and special caution to avoid biasing them. We introduce in this paper the Positive Example Based Learn- ing (PEBL) framework for Web page classification which eliminates the need for manually collecting negative training examples in pre-processing. We present an algorithm called Mapping-Convergence (M-C) that achieves classification accuracy (with positive and unlabeled data) as high as that of traditional SVM (with positive and negative data). Our experiments show that when the M-C algorithm uses the same amount of positive examples as that of traditional SVM, the M-C algorithm performs as well as traditional SVM.
